Evaluating Optimised Decision Procedures for Propositional Modal K(m) Satis ability
نویسندگان
چکیده
Heavily-optimised decision procedures for propositional modal satisability are now becoming available. Two systems incorporating such procedures for modal K, Dlp and KsatC, are tested on randomly-generated CNF formulae with several sets of parameters, varying the maximum modal depth and ratio of propositional variable to modal subformulae. The results show some easy-hard-easy behaviour, but there is as yet no sharp peak as in propositional satis ability.
منابع مشابه
A New System and Methodology for Generating Random Modal Formulae
Previous methods for generating random modal formulae (for the multi-modal logic K (m)) result either in awed test sets or for-mulae that are too hard for current modal decision procedures and, also, unnatural. We present here a new system and generation methodology which results in unnawed test sets and more-natural formulae that are better suited for current decision procedures. Most empirica...
متن کاملGenerating Hard Modal Problems for Modal Decision Procedures
Random generation of modal formulae is a viable method for generating problems for benchmarking modal decision procedures. However, previous work in this area has used a flawed generator that has resulted in questionable results. Fixing the generator changes the characteristics of the generated problems. The fixed generator can be used to generate hard problems that have more interesting modal ...
متن کاملPerformance of DLP on Random Modal Formulae
A system that correctly reasons with information in an expressive description logic includes a decision procedure for an expressive propositional modal logic. This decision procedure must be heavily optimised if it is to be able to usefully reason with knowledge bases of any complexity. Description logic systems that incorporate a heavily-optimised propositional modal logic decision procedure i...
متن کاملNew upper bounds for satis ability in modal K
In this paper we present new time and size bounds for satissability in modal K. This is done by means of a simpliied SAT based procedure. Then, as a direct consequence, we provide theoretical support to the claim of superior eeciency for the SAT based decision procedures, with respect to the \classic" tableau based procedures.
متن کاملResolution Is a Decision Procedure for Many Propositional Modal Logics
The paper shows satissability in many propositional modal systems, including K, KD, KT and KB, their combinations as well as their multi-modal versions, can be decided by ordinary resolution procedures. This follows from a general result that resolution and condensing is a decision procedure for the satissability problem of formulae in so-called path logics. Path logics arise from propositional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999